Hamiltonian path - PDFSEARCH.IO - Document Search Engine

Hamiltonian path
Results: 145

#	Item
101	An update on the middle levels problem Ian Shields ∗ IBM, P.O. Box 12195, Research Triangle Park, North Carolina 27709, USA Brendan J. Shields Department of Physics, Massachusetts Institute of Technology, 77 Massachuse Add to Reading List Source URL: www.cybershields.com Language: English - Date: 2006-08-09 10:23:40 NP-complete problems Graph Tree Hamiltonian path Path decomposition Graph theory Theoretical computer science Mathematics
102	On the Existence of Hamiltonian Paths in the Cover Graph of M (n) Carla D. Savage ∗ Add to Reading List Source URL: www.cybershields.com Language: English - Date: 2004-06-03 00:55:16 Hamiltonian path Hypercube graph Petersen graph Handshaking lemma Graph theory Mathematics NP-complete problems
103	A Hamilton Path Heuristic with Applications to the Middle Two Levels Problem Ian Shields IBM P.O. Box[removed]Research Triangle Park, North Carolina 27709, USA Add to Reading List Source URL: www.cybershields.com Language: English - Date: 2006-06-01 22:54:49 NP-complete problems Graph Hamiltonian path Connectivity Symbol Covering graph Graph theory Mathematics Theoretical computer science
104	Computing the maximum clique in visibility graphs Add to Reading List Source URL: www.tcs.tifr.res.in Language: English - Date: 2010-03-10 01:30:36 Robot control Visibility graph Hamiltonian path Art gallery problem Graph Visibility Clique Independent set Line graph Graph theory NP-complete problems Graph operations
105	MATH 100 ♦ Survey of Mathematics ♦Spring 2012 Leonhard Euler and the K¨ onigsberg Bridges The K¨onigsberg Bridges over the river Pregel C d Add to Reading List Source URL: www.math.hawaii.edu Language: English - Date: 2012-04-03 16:54:41 Degree Path Eulerian path Hamiltonian path Graph theory Tree Graph
106	Jørgen Bang-Jensen, Gregory Gutin Digraphs Theory, Algorithms and Applications 15th August 2007 Add to Reading List Source URL: www.cs.rhul.ac.uk Language: English - Date: 2007-08-15 11:21:41 Directed acyclic graph Graph Shortest path problem Induced path Directed graph Conjectures Line graph Cycle rank Graph theory Theoretical computer science Hamiltonian path
107	3 Introduction to graphs NA TH Add to Reading List Source URL: www.numerical-yoga-guru-rupnathji.net46.net Language: English - Date: 2013-02-20 07:17:37 Spanning tree Graph operations Eulerian path Degree Matroid theory Tree Graph Hamiltonian path Clique Graph theory Mathematics NP-complete problems
108	Undirected Graphs and Networks Networks and graphs A network is a collection of objects connected to each other in some specific way. A graph is a finite set of dots called vertices (or nodes) connected by links called e Add to Reading List Source URL: www.di-mgt.com.au Language: English - Date: 2003-09-21 13:50:00 Graph connectivity Graph coloring Hamiltonian path Eulerian path Path Graph Spanning tree Tree Route inspection problem Graph theory Theoretical computer science NP-complete problems
109	Free Energy Changes, Fluctuations, and Path Probabilities arXiv:submit[removed]cond-mat.stat-mech] 16 Apr 2011 Wm. G. Hoover and Carol G. Hoover Ruby Valley Research Institute Add to Reading List Source URL: www.williamhoover.info Language: English - Date: 2011-04-16 14:00:45 Non-equilibrium thermodynamics Dynamical systems Hamiltonian mechanics Fluctuation theorem Canonical ensemble Partition function Perturbation theory Green–Kubo relations Phase space Physics Statistical mechanics Mechanics
110	How to transform a List Coloring problem into a Traveling Salesman one DRAFT[removed]removed] Abstract This paper describes a method to transform a List Coloring Problem (LCP) into a Traveling Add to Reading List Source URL: clerc.maurice.free.fr Language: English - Date: 2012-11-29 03:08:56 NP-complete problems Travelling salesman problem Graph coloring Hamiltonian path Connectivity Edge coloring Bellman–Ford algorithm Graph theory Theoretical computer science Mathematics

UPDATE